Non-deterministic Multiple-valued Structures
نویسندگان
چکیده
منابع مشابه
Studying Sequent Systems via Non-deterministic Multiple-Valued Matrices
We consider a family of sequent systems with “well-behaved” logical rules in which the cut rule and/or the identity-axiom are not present. We provide a semantic characterization of the logics induced by these systems in the form of non-deterministic three-valued or four-valued matrices. The semantics is used to study some important proof-theoretic properties of these systems. These results shed...
متن کاملMulti-valued Calculi for Logics Based on Non-determinism
Non-deterministic matrices (Nmatrices) are multiple-valued structures in which the value assigned by a valuation to a complex formula can be chosen non-deterministically out of a certain nonempty set of options. We consider two different types of semantics which are based on Nmatrices: the dynamic one and the static one (the latter is new here). We use the Rasiowa-Sikorski (R-S) decomposition m...
متن کاملEffective Non-deterministic Semantics for First-order LFIs
A paraconsistent logic is a logic which allows non-trivial inconsistent theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, which has led to the family of Logics of Formal Inconsistency (LFIs), where the notion of inconsistency is expressed at the object level. In this paper we use non-deterministic matrices, a generalization of standard ...
متن کاملMultiple-valued Logic
s of the Talks In the order in which the talks were given. Walter Carnielli – Non-deterministic Semantics 5 Matthias Baaz – Analytic Calculi for Many-valued Logics 5 Hiroakira Ono – Many-valued Logics as Logics without the Contraction Rule 6 Reiner Hähnle – Proof Theory of Many-valued Logic and Hardware Design 7 Gonzalo Escalada-Imaz – Determining the Truth Degree in Real Time Settings 7 Peter ...
متن کاملUpward Saturated Hyperclones
Hyperoperations are mappings that assign a non-void subset of a set to each n-tuple of elements from the set. They present a fundamental notion for modeling non deterministic processes. Even though for each non deterministic automaton there is a language equivalent deterministic automaton, they do not have the same behavior. As behavior of concurrent processes took place in emerging fields of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Log. Comput.
دوره 15 شماره
صفحات -
تاریخ انتشار 2005